Fundamentals of Volunteer Orientation

Fundamentals of Restricted-orientation Convexity Fundamentals of Restricted-orientation Convexity

A restricted-orientation convex set, also called an O-convex set, is a set of points whose intersection with lines from some xed set is empty or connected. The notion of O-convexity generalizes standard convexity and orthogonal convexity. We explore some of the basic properties of O-convex sets in two and higher dimensions. We also study O-connected sets, which are restricted O-convex sets with...

Fundamentals of Restricted-Orientation Convexity

A restricted-orientation convex set, also called an O-convex set, is a set of points whose intersection with lines from some fixed set is empty or connected. The notion of O-convexity generalizes standard convexity and orthogonal convexity. We explore some of the basic properties of O-convex sets in two and higher dimensions. We also study O-connected sets, which are a subclass of O-convex sets...

Volunteer computing

The explosive growth of interest in platform-independent programming languages for the WorldWide Web , such as Sun Microsystems' Java, is opening exciting new possibilites in parallel computing. This thesis will present and investigate the idea of volunteer computing, which will allow people to volunteer their computers' processing power towards solving a large parallel problem by simply visiti...

Volunteer Monitoring

Running Head: VOLUNTEER COMPUTING GAMES Volunteer Computing Games: Merging Online Casual Gaming with Volunteer Computing

We describe volunteer computing games, a new paradigm for computing which merges volunteer computing and online casual games. In volunteer computing, the main goal is to harness the computational power of many users’ computers to solve a large computational problem. Unfortunately, participants in volunteer computing come from a very limited demographic—primarily middle-aged male computer expert...